منابع مشابه
Pre-Eminent Pricing For Cloud Cache
Caching on the edge of the Internet is becoming a popular technique to improve the scalability and efficiency of delivering dynamic web content and it is rising. These clouds inturn helps in providing good quality query services.In order to query the data users pay for the infrastructure they use required for the query. The goal of cloud economy is to optimize user satisfaction and cloud profit...
متن کاملOptimal Pricing for a Service Facility
This paper investigates optimal pricing policies for a service facility modeled as a queueing system. Arriving customers are accepted if they are willing to pay the price charged by the service provider and if there is room in the waiting area. Capacity of the waiting area can be either finite or infinite. We determine expressions for the optimal prices that maximize the service provider’s long...
متن کاملMDP based optimal pricing for a cloud computing queueing model
We study the optimization of dynamic pricing in a queueing model with a finite buffer, where arrival rates depend on advertised price levels.We apply our study to a pricing policy in a cloud computing service provider setup. The main result of this paper is the multi-threshold structure of the optimal policy. © 2014 Elsevier B.V. All rights reserved.
متن کاملSocially optimal pricing of cloud computing resources
The cloud computing paradigm offers easily accessible computing resources of variable size and capabilities. We consider a cloud-computing facility that provides simultaneous service to a heterogeneous, time-varying population of users, each associated with a distinct job. Both the completion time, as well as the user’s utility, may depend on the amount of computing resources applied to the job...
متن کاملOptimal static pricing for a service facility with holding costs
We study a service facility modelled as a single server queueing system with Poisson arrivals and limited or unlimited buffer size. In systems with unlimited buffer size, the service times have general distributions, whereas in finite buffered systems service times are exponentially distributed. Arriving customers enter if there is room in the facility and if they are willing to pay the posted ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Knowledge and Data Engineering
سال: 2011
ISSN: 1041-4347
DOI: 10.1109/tkde.2011.35